BLUE, BLUP and the Kalman filter: some new results

In this contribution, we extend ‘Kalman-filter’ theory by introducing a new BLUE–BLUP recursion of the partitioned measurement and dynamic models. Instead of working with known state-vector means, we relax the model and assume these means to be unknown. The recursive BLUP is derived from first principles, in which a prominent role is played by the model’s misclosures. As a consequence of the mean state-vector relaxing assumption, the recursion does away with the usual need of having to specify the initial statevector variance matrix. Next to the recursive BLUP, we introduce, for the same model, the recursive BLUE. This extension is another consequence of assuming the state-vector means unknown. In the standard Kalman filter set-up with known state-vector means, such difference between estimation and prediction does not occur. It is shown how the two intertwined recursions can be combined into one general BLUE–BLUP recursion, the outputs of which produce for every epoch, in parallel, the BLUP for the random state-vector and the BLUE for the mean of the state-vector.